package LeetCode.month02.day33;

public class No27 {
    public int removeElement(int[] nums, int val) {
        int left = 0;
        int n = nums.length;
        for (int i = 0; i < n; i++) {
            if(nums[i]!=val){
                nums[left++] = nums[i];
            }
        }
        return left;
    }
}
